Pruning the Search Space of Logic Programs
نویسندگان
چکیده
We analyse the use of pruning operators for reducing the search space of logic programming computations. The synthesis of a few key choices arising in the implementation of pruning operators allows us to compare alternative pruning strategies at a suitably abstract level. In this perspective, we examine the commit operator featured by the language GG odel.
منابع مشابه
Pruning in Logic Programming
The logic programming community has a love{hate relationship with operators for pruning the search space of logic programs such as cut, commit, once, conditionals and variations on these. Pruning operators typically are not declarative, result in incom-pleteness and/or unsoundness, decrease readability and exibility of code and make program analysis and transformation more diicult. Despite this...
متن کاملMulti-paradigm Logic Programming Combining Rewrite Tools for Equational Logic Programming
Introducing equality into standard Horn clauses leads to a programming paradigm known as Equational Logic Programming. We propose here a scheme for the evaluation of such equational logic programs combining two powerful operational techniques : directed narrowing for the equational part and linear completion for the logical part. Thus we provide a goal-oriented solving procedure, keeping the we...
متن کاملA Study on the Practicality of Poly-Controlled Partial Evaluation
Poly-controlled partial evaluation (PCPE) is a flexible approach for specializing logic programs, which has been recently proposed. It takes into account repertoires of global control and local control rules instead of a single, predetermined, combination. Thus, different global and local control rules can be assigned to different call patterns, obtaining results that are hybrid in the sense th...
متن کاملA Proof Procedure for Functional First Order Logic Programs with Non-Deterministic Lazy Functions and Built-in Predicates
We present a proof procedure for functional first-order logic programs. The programs we consider allow first-order goals (including disjunctions, conjunctions, negations, and quantifications on elements of the domain). Atoms are either built-in statements or reduction statements of the form t → s, meaning that t is reducible to s. Call-time choices are used and the functions are non-determinist...
متن کاملLogic + control: On program construction and verification
We present a Prolog program (the SAT solver of Howe and King) as a logic program with added control. The control consists of a selection rule (delays of Prolog) and pruning the search space. We construct the logic program together with proofs of its correctness and completeness, with respect to a formal specification. This is augmented by a proof of termination under any selection rule. Correct...
متن کامل